Repartitioning of Adaptive Meshes: Experiments with Multilevel Diffusion

نویسندگان

  • Kirk Schloegel
  • George Karypis
  • Vipin Kumar
چکیده

For a large class of irregular grid applications the structure of the mesh changes from one phase of the computation to the next Eventually as the graph evolves the adapted mesh has to be reparti tioned to ensure good load balance If this new graph is partitioned from scratch it will lead to an excessive migration of data among processors In this paper we present a new scheme for computing repartitionings of adaptively re ned meshes This scheme performs di usion of vertices in a multilevel framework and minimizes vertex movement without signi cantly compromising the edge cut

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wavefront Diffusion and LMSR: Algorithms for Dynamic Repartitioning of Adaptive Meshes

ÐCurrent multilevel repartitioning schemes tend to perform well on certain types of problems while obtaining worse results for other types of problems. We present two new multilevel algorithms for repartitioning adaptive meshes that improve the performance of multilevel schemes for the types of problems that current schemes perform poorly while maintaining similar or better results for those pr...

متن کامل

Parallel Multilevel Diffusion Algorithms for Repartitioning of Adaptive Meshes ∗

Graph partitioning has been shown to be an effective way to divide a large computation over an arbitrary number of processors. A good partitioning can ensure load balance and minimize the communication overhead of the computation by partitioning an irregular mesh into p equal parts while minimizing the number of edges cut by the partition. For a large class of irregular mesh applications, the s...

متن کامل

The algorithms described in this paper are implemented by the ‘PARMETIS: Parallel Graph Partitioning and Sparse Matrix Ordering Library’.

Graph partitioning has been shown to be an effective way to divide a large computation over an arbitrary number of processors. A good partitioning can ensure load balance and minimize the communication overhead of the computation by partitioning an irregular mesh into p equal parts while minimizing the number of edges cut by the partition. For a large class of irregular mesh applications, the s...

متن کامل

Multilevel Diffusion Schemes for Repartitioning of Adaptive Meshes

For a large class of irregular mesh applications, the structure of the mesh changes from one phase of the computation to the next. Eventually, as the mesh evolves, the adapted mesh has to be repartitioned to ensure good load balance. If this new graph is partitioned from scratch, it may lead to an excessive migration of data among processors. In this paper, we present schemes for computing repa...

متن کامل

A Parallel Implementation of MRSB

The design of a parallel implementation of multilevel recursive spectral bisection (PMRSB) is described. The code is fast enough to enable dynamic repartitioning of adaptive meshes and to partition meshes that are too large for workstations. Two innovations in the implementation are recursive asynchronous task teams and a parallel version of the multilevel accelerator. A performance improvement...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997